Small values of the hyperbolicity constant in graphs

نویسندگان

  • Sergio Bermudo
  • José M. Rodríguez
  • Omar Rosario
  • Jose Maria Sigarreta
چکیده

If X is a geodesic metric space and x1, x2, x3 ∈ X , a geodesic triangle T = {x1, x2, x3} is the union of the three geodesics [x1x2], [x2x3] and [x3x1] in X . The space X is δ-hyperbolic (in the Gromov sense) if any side of T is contained in a δ-neighborhood of the union of the two other sides, for every geodesic triangle T in X . We denote by δ(X) the sharpest hyperbolicity constant of X , i.e., δ(X) := ı́nf{δ ≥ 0 : X is δ-hyperbolic }. In the study of any parameter on graphs it is natural to study the graphs for which this parameter has small values. In this work we study the graphs (with every edge of length k) with small hyperbolicity constant, i.e., the graphs which are like trees (in the Gromov sense). In this work we obtain simple characterizations of the graphs G with δ(G) = k and δ(G) = 5k 4 (the case δ(G) < k is known). Also, we give a necessary condition in order to have δ(G) = 3k 2 (we know that δ(G) is a multiple of k 4 ). Although it is not possible to obtain bounds for the diameter of graphs with small hyperbolicity constant, we obtain such bounds for the effective diameter if δ(G) < 3k 2 . This is the best possible result, since we prove that it is not possible to obtain similar bounds if (.G) ≥ 3k 2 .

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Hyperbolicity of Small-World and Tree-Like Random Graphs

Hyperbolicity is a property of a graph that may be viewed as being a “soft” version of a tree, and recent empirical and theoretical work has suggested that many graphs arising in Internet and related data applications have hyperbolic properties. Here, we consider Gromov’s notion of δ-hyperbolicity, and we establish several positive and negative results for small-world and tree-like random graph...

متن کامل

Gromov Hyperbolicity in Strong Product Graphs

If X is a geodesic metric space and x1, x2, x3 ∈ X, a geodesic triangle T = {x1, x2, x3} is the union of the three geodesics [x1x2], [x2x3] and [x3x1] in X. The space X is δ-hyperbolic (in the Gromov sense) if any side of T is contained in a δ-neighborhood of the union of the two other sides, for every geodesic triangle T in X. If X is hyperbolic, we denote by δ(X) the sharp hyperbolicity const...

متن کامل

Gromov Hyperbolicity in Mycielskian Graphs

Since the characterization of Gromov hyperbolic graphs seems a too ambitious task, there are many papers studying the hyperbolicity of several classes of graphs. In this paper, it is proven that every Mycielskian graph GM is hyperbolic and that δ(GM) is comparable to diam(GM). Furthermore, we study the extremal problems of finding the smallest and largest hyperbolicity constants of such graphs;...

متن کامل

On the edge-connectivity of C_4-free graphs

Let $G$ be a connected graph of order $n$ and minimum degree $delta(G)$.The edge-connectivity $lambda(G)$ of $G$ is the minimum numberof edges whose removal renders $G$ disconnected. It is well-known that$lambda(G) leq delta(G)$,and if $lambda(G)=delta(G)$, then$G$ is said to be maximally edge-connected. A classical resultby Chartrand gives the sufficient condition $delta(G) geq frac{n-1}{2}$fo...

متن کامل

Obstructions to a small hyperbolicity in Helly graphs

It is known that for every graph G there exists the smallest Helly graph H(G) into which G isometrically embeds (H(G) is called the injective hull of G) such that the hyperbolicity of H(G) is equal to the hyperbolicity of G. Motivated by this, we investigate structural properties of Helly graphs that govern their hyperbolicity and identify three isometric subgraphs of the King-grid as structura...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Mathematics

دوره 339  شماره 

صفحات  -

تاریخ انتشار 2016